Search results for "Dynamic Source Routing"
showing 10 items of 33 documents
Addressing Manufacturing Challenges with Cost-Efficient Fault Tolerant Routing
2010
The high-performance computing domain is enriching with the inclusion of Networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge.In this paper, uLBDR (Universal Logic-Based Distributed Routing) is proposed as an efficient logic-based mechanism that adapts to any irregular topology derived from 2D meshes, being an alter…
A Novel Energy Model for MANETs based on Graphs with Activation Windows
2005
Energy usage optimization is still an important issue and a critical design factor for mobile ad hoc networks (MANETs). Only recently a few proposals appeared that consider energy-aware optimizations for routing protocols. In this paper we describe an analytical model for MANETs which is based on graphs with activation windows. The activation windows allow to model the on-off status of the network devices. Moreover, we propose an algorithm with pseudo-polynomial complexity, called STP algorithm (STPA), that based on the current position and state of the nodes determines the shortest time path between the source node and the destination node.
Lifespan-Aware Routing for Wireless Sensor Networks
2010
Wireless Sensor Networks (WSNs) have the capability to become the eyes and ears for the future networked society allowing monitoring of any habitat or object's properties remotely and independently of an energy source. Services based on this technology may change the way we monitor and control remote areas and objects. In this paper we propose a different approach to routing data across Wireless Sensor Networks. We argue that a distance-vector protocol using a lifespan-aware metric is a plausible solution to the task of routing information in WSN in a manner that both saves energy of the individual node and manages summarized energy of the system equally and fairly. The concept is designed …
Stability Analysis of Routing Strategies for the Maximum Lifetime Problem in One-Dimensional Ad-Hoc Wireless Networks
2017
In the paper we discuss solutions of the maximum network lifetime problem in one-dimensional, regular ad-hoc wireless networks. For the problem, nodes of the network generate given amount of data and send it possibly via other nodes to the data collector. To extend the network lifetime the data should be transmitted in such a way, that the energy utilized by the most overloaded node is minimized. We assume, that the nodes use the point-to-point data transmission scheme and the cost of transmission of one unit of data is arbitrary superadditive function of a distance between transmitter and receiver. We show that for the one-dimensional network in which the nodes are evenly distributed on th…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks
2009
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based Routing Algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis an…
A flexible and tunable route discovery mechanism for on-demand protocols
2004
Mobile ad-hoc networks are characterized by multihop wireless links and absence of cellular infrastructure. For the last years, routing has been the area under most intensive research. In particular, on-demand routing protocols proposed are extremely attractive due to their low-overhead and efficiency. Currently, wireless ad-hoc networks lack multipath routing protocols. Multipath routing enables increased QoS support, load balancing and enhanced route stability. In this paper we present a new route discovery solution that increases the number of routes found, while reducing the routing overhead when compared to previous proposals. Simulation results show that the additional routing overhea…
Logic-Based Distributed Routing for NoCs
2008
The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are usually proposed for NoCs, heterogeneous cores, manufacturing defects, hard failures, and chip virtualization may lead to irregular topologies. In this context, efficient routing becomes a challenge. Although switches can be easily configured to support most routing algorithms and topologies by using routing tables, this solution does not scale in terms of latency and area. We propose a new circuit that removes the need for using routing tables. The new mechanism, referred to as logic-based dis…
OLSR Mesh Networks for Broadband Access: Enhancements, Implementation and Deployment
2008
In the context of an EU FP6 project, ADHOCSYS, we have developed a reliable and cost-effective solution for broadband Internet access in rural and mountainous areas. This solution is built based on multi-hop wireless mesh networking technologies and covers many aspects such as routing, reliability, QoS, security, self-configuration, self-healing, remote network monitoring, power management etc. In this paper, we present solely the routing aspect of the developed mesh network, focusing on new routing features that have been designed, implemented, and deployed in a real-life operational network. These new features are developed based on an extended version of the OLSR protocol. The test resul…
A multi-parametric evolution strategies algorithm for vehicle routing problems
2007
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …